Wavelet analysis on symbolic sequences and two-fold de Bruijn sequences
نویسنده
چکیده
The concept of symbolic sequences play important role in study of complex systems. In the work we are interested in ultrametric structure of the set of cyclic sequences naturally arising in theory of dynamical systems. Aimed at construction of analytic and numerical methods for investigation of clusters we introduce operator language on the space of symbolic sequences and propose an approach based on wavelet analysis for study of the cluster hierarchy. The analytic power of the approach is demonstrated by derivation of a formula for counting of twofold de Bruijn sequences, the extension of the notion of de Bruijn sequences. Possible advantages of the developed description is also discussed in context of applied problem of construction of efficient DNA sequence assembly algorithms. 1. Motivation and structure. Nowadays symbolic sequences is a fundamental concept widely used in various fields of natural sciences [1–9]. In bioinformatics, theory of information, and theory of discreet Markov chains the intrinsic structure of objects under consideration provides direct mapping on symbolic sequences [1]. Less obvious extension of the symbolic approach one can find in study of complex behavior in dynamical systems [2,3]. In essence, the underlying idea is in organization of a stroboscopic sampling of the multidimensional trajectory. In case of Hamiltonian systems one constructs a Poincaré section surface in phase-space [10], such that it is oriented orthogonal to the dynamical flow at each point. Linearization of the dynamics allows to separate stable and unstable directions of motion and thus define the set of feasible positions at the next crossing of the Poincaré section surface. All intersections falling within the same sub-region of the surface are designated by a certain symbol. For the system possessing a chaotic dynamics one can aver existence of the Markov partitioning of the surface, meaning that each next symbol in the symbolic dynamics is defined only by the previous one. For infinite or cyclic sequences the real trajectory can be uniquely restored from the symbolic dynamics. Often, the obtained Markov alphabet includes an infinite number of symbols, as, for instance, in chaotic billiards, out of the flow discontinuity on the billiard walls. It is
منابع مشابه
Clustering of Short Read Sequences for de novo Transcriptome Assembly
Given the importance of transcriptome analysis in various biological studies and considering thevast amount of whole transcriptome sequencing data, it seems necessary to develop analgorithm to assemble transcriptome data. In this study we propose an algorithm fortranscriptome assembly in the absence of a reference genome. First, the contiguous sequencesare generated using de Bruijn graph with d...
متن کاملOn Binary de Bruijn Sequences from LFSRs with Arbitrary Characteristic Polynomials
We propose a construction of de Bruijn sequences by the cycle joining method from linear feedback shift registers (LFSRs) with arbitrary characteristic polynomial f(x). We study in detail the cycle structure of the set Ω(f(x)) that contains all sequences produced by a specific LFSR on distinct inputs and provide an efficient way to find a state of each cycle. Our structural results lead to an e...
متن کاملBinary De Bruijn sequences for DS-CDMA systems: analysis and results
Code division multiple access (CDMA) using direct sequence (DS) spread spectrum modulation provides multiple access capability essentially thanks to the adoption of proper sequences as spreading codes. The ability of a DSCDMA receiver to detect the desired signal relies to a great extent on the auto-correlation properties of the spreading code associated to each user; on the other hand, multi-u...
متن کاملGenerating (n, 2) De Bruijn Sequences with Some Balance and Uniformity Properties
This paper presents two new algorithms for generating (n,2) de Bruijn sequences which possess certain properties. The sequences generated by the proposed algorithms may be useful for experimenters to systematically investigate intertrial repetition effects. Characteristics are compared with those of randomly sampled (n,2) de Bruijn sequences.
متن کاملCryptographically Strong de Bruijn Sequences with Large Periods
In this paper we first refine Mykkeltveit et al.’s technique for producing de Bruijn sequences through compositions. We then conduct an analysis on an approximation of the feedback functions that generate de Bruijn sequences. The cycle structures of the approximated feedback functions and the linear complexity of a sequence produced by an approximated feedback function are determined. Furthermo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016